Package ‘ label . switching ’ July 2 , 2014

نویسنده

  • Panagiotis Papastamoulis
چکیده

July 2, 2014 Type Package Title Relabelling MCMC outputs of mixture models Version 1.2 Date 2013-12-04 Author Panagiotis Papastamoulis Maintainer Panagiotis Papastamoulis Description The Bayesian estimation of mixture models (and more general hidden Markov models) suffers from the label switching phenomenon, making the MCMC output non-identifiable. This package can be used in order to deal with this problem using various relabelling algorithms. Depends lpSolve, combinat License GPL-2 NeedsCompilation no Repository CRAN Date/Publication 2013-12-04 11:42:13

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Package ‘ label . switching ’

February 20, 2015 Type Package Title Relabelling MCMC outputs of mixture models Version 1.3 Date 2014-11-04 Author Panagiotis Papastamoulis Maintainer Panagiotis Papastamoulis Description The Bayesian estimation of mixture models (and more general hidden Markov models) suffers from the label switching phenomenon, making the MCMC output non-identifiable. This package can be u...

متن کامل

Requirements for Point to Multipoint Traffic Engineered MPLS LSPs <draft-ietf-mpls-p2mp-requirement-03.txt>

This document presents a set of requirements for Point-to-Multipoint(P2MP) Traffic Engineered (TE) Multiprotocol Label Switching (MPLS) Label Switched Paths (LSPs). It specifies functional requirements for solutions in order to deliver P2MP applications over a MPLS TE infrastructure. It is intended that solutions that specify procedures for P2MP TE LSP setup satisfy these requirements. Yasukawa...

متن کامل

Shortest Constrained Point - to - Multipoint ( P 2 MP ) Inter - Domain Traffic Engineering Label Switched Paths

The ability to compute paths for constrained point-to-multipoint (P2MP) Traffic Engineering Label Switched Paths (TE LSPs) across multiple domains has been identified as a key requirement for the deployment of P2MP services in MPLSand GMPLS-controlled networks. The Path Computation Element (PCE) has been recognized as an appropriate technology for the determination of inter-domain paths of P2MP...

متن کامل

Internet Draft PCE Architecture

Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks. Path computation in large, multi-domain, multi-region or multi-layer networks is highly complex and may require special computational components and cooperation between the different network...

متن کامل

RFC 5212 MRN / MLN Requirements July 2008

Most of the initial efforts to utilize Generalized MPLS (GMPLS) have been related to environments hosting devices with a single switching capability. The complexity raised by the control of such data planes is similar to that seen in classical IP/MPLS networks. By extending MPLS to support multiple switching technologies, GMPLS provides a comprehensive framework for the control of a multi-layer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014